Steiner triple ( quadruple ) systems of small ranks embedded into perfect ( extended perfect ) binary codes 1
نویسنده
چکیده
It is shown that a class of Steiner triple systems of order 2−1, obtained by some special switchings from the Hamming Steiner triple system, is embedded into some perfect code, constructed by known switchings of ijk-components from the binary Hamming code. The number of Steiner triple systems of order n and rank less or equal n− log(n + 1) + 2, embedded into perfect binary codes of length n, is given. Similar results are obtained for Steiner quadruple systems.
منابع مشابه
Embedding in a perfect code
For any 1-error-correcting binary code C of length m we will construct a 1-perfect binary code P (C) of length n = 2 − 1 such that fixing the last n − m coordinates by zeroes in P (C) gives C. In particular, any complete or partial Steiner triple system (or any other system that forms a 1-code) can always be embedded in a 1-perfect code of some length (compare with [13]). Since the weight-3 wor...
متن کاملThe Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5 983 such inequivalent perfect codes and 2 165 extended perfect codes. Efficient generation of these codes relies on the recent classification of Steiner quadruple systems of order 16. Utilizing a result of Blackmore, the optimal binary one-er...
متن کاملSQS-graphs of extended 1-perfect codes
An extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ with 9 ≥ κ ≥ 5 obtained via Solov’eva-Phelps doubling construction. Each of the 361 resulting graphs has most of its nonloop edges expressible in terms o...
متن کاملOn 2-ranks of Steiner triple systems
Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code | called the \carrier" | which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number of points of the system, the carrier organizes all the information necessary to construct directly all systems ...
متن کاملOn binary 1-perfect additive codes: Some structural properties
The rank and kernel of 1-perfect additive codes is determined. Additive codes could be seen as translation-invariant propelinear codes and, in this correspondence, a characterization of propelinear codes as codes having a regular subgroup of the full group of isometries of the code is established. A characterization of the automorphism group of a 1-perfect additive code is given and also the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012